Linear complexity of quaternary sequences over Z4 based on Ding-Helleseth generalized cyclotomic classes

摘要

A family of quaternary sequences over Z4 is defined based on theDing-Helleseth generalized cyclotomic classes modulo pq for two distinct oddprimes p and q. The linear complexity is determined by computing the definingpolynomial of the sequences, which is in fact connected with the discreteFourier transform of the sequences. The results show that the sequences possesslarge linear complexity and are good sequences from the viewpoint ofcryptography.